Learning to Select Branching Rules in the DPLL Procedure for Satisfiability
نویسندگان
چکیده
منابع مشابه
Learning to Select Branching Rules in the DPLL Procedure for Satisfiability
The DPLL procedure is the most popular complete satisfiability (SAT) solver. While its worst case complexity is exponential, the actual running time is greatly affected by the ordering of branch variables during the search. Several branching rules have been proposed, but none is the best in all cases. This work investigates the use of automated methods for choosing the most appropriate branchin...
متن کاملAdding resolution to the DPLL procedure for Boolean satisfiability
We study the tradeoff between inference and search in the Davis Putnam algorithm. We show that neighbour resolution, a restricted form of resolution applied during search, can be simulated by applying binary resolution before search. We compare experimentally the cost of the two different methods. Our results demonstrate that binary resolution during preprocessing is generally effective at redu...
متن کاملHow Good Are Branching Rules in DPLL?
The Davis-Putnam-Logemann-Loveland algorithm is one of the most popular algorithms for solving the satis ability problem. Its e ciency depends on its choice of a branching rule. We construct a sequence of instances of the satis ability problem that fools a variety of \sensible" branching rules in the following sense: when the instance has n variables, each of the \sensible" branching rules brin...
متن کاملNew updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability
The paper is concerned with the computational evaluation and comparison of a new family of conflict-based branching heuristics for evolved DPLL Satisfiability solvers. Such a family of heuristics is based on the use of new scores updating criteria developed in order to overcome some of the typical unpleasant behaviors of DPLL search techniques. In particular, a score is associated with each lit...
متن کاملBranching Rules for Satisfiability Analysed with Factor Analysis
Factor analysis is a statistical technique for reducing the number of factors responsible for a matrix of correlations to a smaller number of factors that may reflect underlying variables. Experiments with constraint satisfaction problems (CSPs) using factor analysis suggest that for some (perhaps many) classes of problems, there are only a few distinct principles of heuristic action. In this p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2001
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00332-4